Bounding prefix transposition distance for strings and permutations
نویسندگان
چکیده
منابع مشابه
Generation of Permutations by Transposition
(3) All calculations are mod m¡ so that the digits of the mixed radix representation of [x]u can be obtained using only calculations mod m¡. (4) The value x x(a) can be obtained from x x(a) = x x(a_1) 4x(°_1) x " so that the modular number x need not be remembered during the whole process. (5) The matrices (do) and (x.j) are computed preliminary to the iteration procedure and are not part of it.
متن کاملPrefix transpositions on binary and ternary strings
The problem of Sorting by Prefix Transpositions asks for the minimum number of prefix transpositions required to sort the elements of a given permutation. In this paper, we study a variant of this problem where the prefix transpositions act not on permutations but on strings over an alphabet of fixed size. Here, we determine the minimum number of prefix transpositions required to sort the binar...
متن کاملPrefix Reversals on Binary and Ternary Strings
Given a permutation π, the application of prefix reversal f (i) to π reverses the order of the first i elements of π. The problem of sorting by prefix reversals (also known as pancake flipping), made famous by Gates and Papadimitriou (Discrete Math., 27 (1979), pp. 47–57), asks for the minimum number of prefix reversals required to sort the elements of a given permutation. In this paper we stud...
متن کاملConnections between Bernoulli Strings and Random Permutations
A sequence of random variables, each taking only two values ”0” or ”1”, is called a Bernoulli sequence. Consider the counts of occurrences of strings of the form {11}, {101}, {1001}, . . . in Bernoulli sequences. Counts of such Bernoulli strings arise in the study of the cycle structure of random permutations, Bayesian nonparametrics, record values etc. The joint distribution of such counts is ...
متن کاملSecure & Lightweight Distance-Bounding
Distance-bounding is a practical solution aiming to prevent relay attacks. The main challenge when designing such protocols is maintaining their inexpensive cryptographic nature, whilst being able to protect against as many, if not all, of the classical threats posed in their context. Moreover, in distancebounding, some subtle security shortcomings related to the PRF (pseudorandom function) ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.11.018